Computational number theory - PDFSEARCH.IO - Document Search Engine

Computational number theory
Results: 224

#	Item
51	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 NP-complete problems Vertex cover Reduction Ordinal number Parameterized complexity Cardinality APX Set cover problem Polygonal chain Theoretical computer science Computational complexity theory Mathematics
52	Boolean Decision Functions Steven Finch April 22, 2015 Let  : {0 1} → {0 1} be the Boolean function that decides whether a given ( + 1)-bit odd integer is square-free. More precisely, ½ Add to Reading List Source URL: www.people.fas.harvard.edu Language: English - Date: 2015-04-21 10:31:24 Integer sequences Algebra Polynomials FO Computational complexity theory Prime number Primality test Square-free integer Irreducible polynomial Mathematics Theoretical computer science Complexity classes
53	A Practical Approach to Approximating the Diameter of Point-set in Low Dimensions Kumar Gaurav Bijay∗ Antoine Vigneron† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:45 Analysis of algorithms Computational complexity theory Time complexity Factorial Mathematics Theoretical computer science Number theory
54	ICS 161 — Algorithms — Winter 2005 — First Midterm Please answer the following six questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to write Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-04-21 19:41:07 Sorting algorithms Computational complexity theory Algorithm Mathematical logic Prime number Radix sort Multiplication algorithm Time complexity Anatolii Alexeevitch Karatsuba Mathematics Theoretical computer science Multiplication
55	CALL FOR PAPERS INTERNATIONAL INSTITUTE OF SCIENCE ENGINEERING AND MANAGEMENT (IISEMEURO-ASIA CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SIGNAL PROCESSING (CISPMarch 23-24, 2015 London (United Kingdom) ww Add to Reading List Source URL: iisem.org Language: English - Date: 2014-09-30 23:55:45 Competitions Digital media Grants Research Abstract management Electronic submission Academic conference Algorithmic Number Theory Symposium Academic publishing Knowledge Academia Education
56	System Behaviors and Measures: Compressed State Complexity and Number of Unique States Used in Naval Weapons Elevators Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2014-05-30 12:15:58 Structure Applied mathematics Computational complexity theory Finite model theory Complexity Complex systems Physical system FO Algorithm Systems Science Complex systems theory
57	PDF Document Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2008-01-09 04:26:18 OSI protocols Electronic engineering IEEE 802 Computational number theory Lattice points MIMO Orthogonal frequency-division multiplexing Multi-carrier code division multiple access Spatial multiplexing Radio resource management Information theory Telecommunications engineering
58	CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m. Examples: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:50 NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory
59	counting colours in compressed strings Travis Gagie Juha K¨arkk¨ainen CPM 2011 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2011-09-22 14:04:56 Arithmetic functions Analysis of algorithms Asymptotic analysis Mathematical notation Number theory Computational complexity of mathematical operations Chebyshev function Mathematics Mathematical analysis Theoretical computer science
60	Review of Probably Approximate Correct, by Leslie Valiant. (Basic Books, 2013, x+195 pps.) In 2010, Leslie Valiant won the Turing Award, the “Nobel prize of computer science”. The citation mentioned a number of contr Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2015-03-15 21:24:02 Computer science Theoretical computer science Artificial intelligence Probably approximately correct learning Learning Learnability Leslie Valiant Supervised learning Algorithm Computational learning theory Machine learning Applied mathematics

UPDATE